Strengthening lattice-free cuts using non-negativity
نویسندگان
چکیده
منابع مشابه
Strengthening lattice-free cuts using non-negativity
Abstract In recent years there has been growing interest in generating valid inequalities for mixedinteger programs using sets with 2 or more constraints. In particular, Andersen et al. (2007) and Borozan and Cornuéjols (2007) study sets defined by equations that contain exactly one integer variable per row. The integer variables are not restricted in sign. Cutting planes based on this approach...
متن کاملStrengthening Chvátal-Gomory cuts and Gomory fractional cuts
Chvátal-Gomory and Gomory fractional cuts are well-known cutting planes for pure integer programming problems. Various methods for strengthening them are known, for example based on subadditive functions or disjunctive techniques. We present a new and surprisingly simple strengthening procedure, discuss its properties, and present some computational results.
متن کاملNon-rigid Image Registration Using Graph-cuts
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a powerful combinatorial optimization tool which has been successfully applied into image segmentation and stereo matching. Under some specific constraints, graph-cuts method yields either a global minimum or a local min...
متن کاملNon-monotonic Negativity
The main aim of this paper is to provide a new analysis of licensers of negative polarity items (NPIs). The problems with Fauconnier-Ladusaw's downward entailment analysis have been argued since Linebarger (1980). I will show that there exists a class of weak NPI licensers characterized by non-monotonicity and exclusivity. Weak negation, which is monotone decreasing, has been known to license w...
متن کاملStrengthening Chvátal-Gomory Cuts for the Stable Set Problem
The stable set problem is a well-knownNP-hard combinatorial optimization problem. As well as being hard to solve (or even approximate) in theory, it is often hard to solve in practice. The main difficulty is that upper bounds based on linear programming (LP) tend to be weak, whereas upper bounds based on semidefinite programming (SDP) take a long time to compute. We propose a new method to stre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2011
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2010.09.002